Degree-constrained spanning trees
نویسندگان
چکیده
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-tough graphs 4 Ruonan Li Long properly colored cycles in edge-colored complete graphs 5 Lasse Kliemann A streaming algorithm for the undirected longest path problem 5 Kenta Ozeki Hamiltonicity of graphs on surfaces 6 Eckhard Steffen Edge colorings and circular flow numbers of regular graphs 6 Michel Surmacs Pancyclic arcs in Hamiltonian cycles of tournaments 7 Carsten Thomassen Chords in longest cycles 8 Nico Van Cleemput Connections between decomposition trees of 3-connected plane triangulations and Hamiltonian properties 8
منابع مشابه
Approximation of the Degree-Constrained Minimum Spanning Hierarchies
Degree-bounded spanning problems are well known and are mainly used to solve capacity constrained communication (routing) problems. The degree-constrained spanning tree problems are NP-hard and the minimum cost spanning tree is not approximable nor in the case where the entire graph must be spanned neither in partial spanning problems. Most of applications (such as communications) do not need t...
متن کاملEdge sets: an effective evolutionary coding of spanning trees
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for this representation. The operators...
متن کاملA new evolutionary approach to the degree-constrained minimum spanning tree problem
Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a wellstudied NP-hard problem of importance in communications network design and other network-related problems. In this paper we describe some previously proposed algorithms for solving the problem, and then introduce a novel tree construction algorithm called the Randomised Primal Method (RPM) which builds degree-const...
متن کاملImplementations of Dynamic Tree Collections Based on Splay Trees
We describe implementations of two closely related variants of dynamic rooted trees. These variants are similar to Sleator and Tarjan's dynamic trees, but instead of the operation of nding the minimum key on the path from a given node to the root, we have the operation of nding the minimum key in the subtree of a given node (the rst variant) and the operation of nding a xed key value in the sub...
متن کاملSpanning Trees with Node Degree Dependent Costs and Knapsack Reformulations
The Degree constrained Minimum Spanning Tree Problem (DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has degree no greater than a fixed value. We consider a generalization with a more general objective function including modular costs associated to the degree of each node. We present linear programming models together with some valid inequalitie...
متن کاملA Comparison of Encodings and Algorithms for Multiobjective Minimum Spanning Tree Problems
Finding minimum-weight spanning trees (MST) in graphs is a classic problem in operations research with important applications in network design. The basic MST problem can be solved eeciently, but the degree constrained and multiobjective versions are NP-hard. Current approaches to the degree-constrained single objective MST include Raidl's evolutionary algorithm (EA) which employs a direct tree...
متن کامل